Polynomially-bounded Dehn functions of groups
نویسندگان
چکیده
منابع مشابه
Polynomially bounded cohomology and discrete groups
We establish the homological foundations for studying polynomially bounded group cohomology, and show that the natural map from PH∗(G;Q) to H∗(G;Q) is an isomorphism for a certain class of groups. © 2004 Elsevier B.V. All rights reserved. MSC: 18G10; 18G40; 13D99; 16E30; 20J05; 20F05; 20F65
متن کاملThe Mean Dehn Functions of Abelian Groups
While Dehn functions, D(n), of finitely presented groups are very well studied in the literature, mean Dehn functions are much less considered. M. Gromov introduced the notion of mean Dehn function of a group, Dmean(n), suggesting that in many cases it should grow much more slowly than the Dehn function itself. Using only elementary counting methods, this paper presents some computations pointi...
متن کاملGroups with Quadratic-Non-Quadratic Dehn Functions
We construct a finitely presented group G with non-quadratic Dehn function f majorizable by a quadratic function on arbitrary long intervals.
متن کاملAveraged Dehn Functions for Nilpotent Groups
Gromov proposed an averaged version of the Dehn function and claimed that in many cases it should be subasymptotic to the Dehn function. Using results on random walks in nilpotent groups, we confirm this claim for most nilpotent groups. In particular, if a nilpotent group satisfies the isoperimetric inequality δ(l) < Clα for α > 2 then it satisfies the averaged isoperimetric inequality δ(l) < C...
متن کاملAlgorithms, Dehn Functions, and Automatic Groups
Ever since it was shown in the mid 1980s that being word hyperbolic was equivalent to the existence of a linear time solution to the word problem, computational and algorithmic issues have been intimately intertwined with geometric and topological ones in the study of infinite groups. The scope of this chapter is indicated by the three topics in its title: algorithms, Dehn functions, and automa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Algebra
سال: 2018
ISSN: 2415-6302
DOI: 10.4171/jca/2-4-1